A very fast multiplication algorithm for VLSI implementation
نویسندگان
چکیده
منابع مشابه
A VLSI Algorithm for Modular Multiplication/Division
We propose an algorithm for modular multiplication/division suitable for VLSI implementation. The algorithm is based on Montgomery’s method for modular multiplication and on the extended Binary GCD algorithm for modular division. It can perform either of these operations with a reduced amount of hardware. Both calculations are carried out through iterations of simple operations such as shifts a...
متن کاملA Vertex Detection Algorithm for VLSI Implementation
This paper describes a dataow vertex detection algorithm for polygonal modeling of 2D contours. VLSI implementation by a parallel architecture is also proposed. This work is part of a real-time shape recognition system using polygonal models, presently under development.
متن کاملAn Efficient Fast Dht Algorithm for Vlsi Implementation Using Split Radix Algorithm
A new very large scale integration (VLSI) algorithm for a 2N-length discrete Hartley transform (DHT) that can be efficiently implemented on a highly modular and parallel VLSI architecture having a regular structure is presented. The DHT algorithm can be efficiently split on several parallel parts that can be executed concurrently. Moreover, the proposed algorithm is well suited for the subexpre...
متن کاملResourceful Fast Dht Algorithm for Vlsi Implementation by Split Radix Algorithm
A new very large scale integration (VLSI) algorithmic rule for a 2 N -length discrete hartley transform (DHT) that may be expeditiously enforced on a extremely standard and parallel VLSI design having a regular structure is given. The DHT algorithmic rule may be expeditiously split on many parallel elements that may be dead at the same time. Moreover, the planned algorithmic rule is compatible ...
متن کاملA Very Fast Algorithm for Matrix Factorization
We present a very fast algorithm for general matrix factorization of a data matrix for use in the statistical analysis of high-dimensional data via latent factors. Such data are prevalent across many application areas and generate an ever-increasing demand for methods of dimension reduction in order to undertake the statistical analysis of interest. Our algorithm uses a gradient-based approachw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Integration
سال: 1983
ISSN: 0167-9260
DOI: 10.1016/0167-9260(83)90005-6